Traces, Pomsets, Fairness and Full Abstraction for Communicating Processes
نویسنده
چکیده
We provide a denotational trace semantics for processes with synchronous communication and a form of weakly fair parallelism. The semantics is fully abstract: processes have the same trace sets if and only if their communication behaviors are identical in all contexts. The model can easily be adapted for asynchronously communicating processes, or for shared-memory parallel programs. We also provide a partial-order semantics, using pomsets adapted for synchronization and our form of fairness. The pomset semantics can also be adjusted to model alternative paradigms. The traces of a process can be recovered from the pomset semantics by taking all fair interleavings consistent with the partial order.
منابع مشابه
Strong Fairness and Full Abstraction for Communicating Processes
We construct several denotational semantics for communicating processes that incorporate assumptions of strong (process) fairness. Strong fairness is the guarantee that every process enabled infinitely often will make progress infinitely often. Modeling fairness compositionally requires care: generally speaking, the fair computations of a command cannot be defined only in terms of the fair comp...
متن کاملDeconstructing CCS and CSP Asynchronous Communication, Fairness, and Full Abstraction
The process algebras CCS and CSP assume that processes interact by means of handshake communication, although it would have been equally reasonable to have adopted asynchronous communication as primitive. Traditional semantics of CCS (based on bisimulation) and CSP (such as the failures model) do not assume fair parallel composition, although fairness is often vital in ensuring liveness propert...
متن کاملFull Abstraction for Series-Parallel Pomsets
In this paper, we provide a behavioural characterization of the class of finite, seriesparallel pomsets by showing that this simple model based on partial orders is fullyabstract with respect to the behavioural equivalence obtained by applying Abramsky's testing scenario for bisimulation equivalence, [Ab87], in all refinement contexts, [AH89]. This casts the observability of series-parallel por...
متن کاملProcess Algebra with Iteration
We introduce iteration in process algebra by means of (the binary version of) Kleene's star operator: x y is the process that chooses between x and y, and upon termination of x has this choice again. It is proved that adding respectively interleaving, communication and abstraction operators increases expressivity up to the regular processes. However, if the distinction between (successful) term...
متن کاملProbabilistic Communicating Processes
We explore the suitability of two semantic spaces as a basis for a probabilistic variant of the language of Communicating Sequential Processes (UP), so as to provide a formalism for the specification and proof of correctness of probabilistic algorithms. The two spaces give rise to two sublanguages, each of which is characterised by an algebraic axiomatisation which is shown to be sound and comp...
متن کامل